LIBTP: Portable, Modular Transactions for UNIX1

نویسندگان

  • Margo Seltzer
  • Michael Olson
چکیده

Transactions provide a useful programming paradigm for maintaining logical consistency, arbitrating concurrent access, and managing recovery. In traditional UNIX systems, the only easy way of using transactions is to purchase a database system. Such systems are often slow, costly, and may not provide the exact functionality desired. This paper presents the design, implementation, and performance of LIBTP, a simple, non-proprietary transaction library using the 4.4BSD database access routines (db(3)). On a conventional transaction processing style benchmark, its performance is approximately 85% that of the database access routines without transaction protection, 200% that of using fsync(2) to commit modifications to disk, and 125% that of a commercial relational database system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controller/Precompiler for Portable Checkpointing

This paper presents CPPC (Controller/Precompiler for Portable Checkpointing), a checkpointing tool designed for heterogeneous clusters and Grid infrastructures through the use of portable protocols, portable checkpoint files and portable code. It works at variable level being user-directed, thus generating small checkpoint files. It allows parallel processes to checkpoint independently, without...

متن کامل

Coping with Conflicts in an Optimistically Replicated File System

Coda is a scalable distributed Unix1 file system that provides high availability through the use of two distinct but complementary mechanisms. One mechanism, server replication, stores copies of a file at multiple servers. The other mechanism, disconnected operation, is a mode of execution in which a caching site temporarily assumes the role of a replication site. Disconnected operation is part...

متن کامل

Comparison of Three Modular Reduction Functions

Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgomery’s algorithm. These algorithms are a time critical step in the implementation of the modular exponentiation operation. For each of these algorithms their application in the modular exponentiation operation is consid...

متن کامل

Blast resistant modular buildings for the petroleum and chemical processing industries.

There exists a need for blast resistant yet portable buildings to protect personnel temporarily assigned duties within explosively hazardous areas. Blast resistant portable buildings (BRPBs) are a valuable asset for protection of temporarily assigned personnel involved in activities located near potential explosion sites. Portable. Stackable and modular. Blast designed and ductile. Several comp...

متن کامل

Fixed Point Results for Cyclic (α,β)-Admissible Type F-Contractions‎ ‎in Modular Spaces

In this paper, we prove the existence and uniqueness of fixed points for cyclic (α,β)-admissible type F-contraction and F−weak contraction under the setting of modular spaces, where the modular is convex and satisfying the ∆2-condition. Later, we prove some periodic point results for self-mappings on a modular space. We also give some examples to s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992